Willard Thompson
نویسنده
چکیده
Complexity theory has a profound influence on the field of cryptology. The time complexity of breaking a cipher system must be significant enough to thwart any adversary from succeeding. However, with the emergence of quantum computers an adversary may have no difficulty in breaking known cipher systems. If quantum computers would exist today new mechanisms for security would need to be built. This research paper covers some of the complexity theoretic characteristics for quantum cryptography. The report first covers some important work regarding quantum cryptography. Then along with some background of linear algebra and vector spaces, Peter Shor’s probabilistic polynomial time bounded algorithm for prime factorization is covered. Finally, a discussion of new mechanisms for provable security with respect to the existence of quantum computers having near infinite power is presented.
منابع مشابه
Mobile Agent Data Integrity Using Multi-agent Architecture
Protection of agent data state and partial results in mobile agent systems continues to draw research interest. Current solutions to integrity attacks are geared at detection of malicious activity a posteriori. We propose multi-agent architecture that uses cooperating multi-hop and single-hop agents to prevent such attacks and discuss security features of our scheme. We also examine data protec...
متن کاملSemantic Encryption Transformation Scheme
We present a scheme to protect mobile code from malicious hosts. We propose a transformation scheme that changes the semantics of a program using pseudorandom I/O scrambling, conditional elimination, and encryption using numeric variables for changing programs into encrypted but executable form that yields a recoverable result. The goal of our transformation process is to prevent an attacker fr...
متن کاملImproving Energy for Mobile Computers Through Process Migration Logging
In order to accelerate the efficiency of mobile computing, better solutions for conserving power for mobile computers need to be discovered. The battery power of mobile computers is barely tolerable and almost any amount of computation is difficult to sustain with such resources. In this research paper we explore finding an optimal logging block size for migrating processes on a mobile network ...
متن کاملLinear preservers of Miranda-Thompson majorization on MM;N
Miranda-Thompson majorization is a group-induced cone ordering on $mathbb{R}^{n}$ induced by the group of generalized permutation with determinants equal to 1. In this paper, we generalize Miranda-Thompson majorization on the matrices. For $X$, $Yin M_{m,n}$, $X$ is said to be Miranda-Thompson majorized by $Y$ (denoted by $Xprec_{mt}Y$) if there exists some $Din rm{Conv(G)}$ s...
متن کامل